Elementariness of a finite set of words is co-NP-complete
نویسندگان
چکیده
منابع مشابه
The Set of Minimal Braids is co-NP-Complete
Braids ñàï Üå represented as two-dimenSional diagrams showing the crossings of strings or as words over the generators of à braid group. À minimal braid is îïå with the fewest crossings (or the shortest words) among all possible repre~entations topologically equivalent to that braid. ÒÜå main result of this paper is that the set of minimal braids is co-NP-complete. Algorithmic problems in braid...
متن کاملIrreversible 2-conversion set is NP-complete
An irreversible k-threshold process is a process on a graph where vertices change color from white to black if they have at least k black neighbors. An irreversible k-conversion set is a subset S of vertices of a graph G such that the irreversible k-threshold process changes all vertices of G to black if S is the initial set of black vertices. We show that deciding the existence of an irreversi...
متن کاملP-matrix recognition is co-NP-complete
This is a summary of the proof by G.E. Coxson [1] that P-matrix recognition is co-NP-complete. The result follows by a reduction from the MAX CUT problem using results of S. Poljak and J. Rohn [5].
متن کاملProtocol Insecurity with Finite Number of Sessions is NP-Complete
We investigate the complexity of the protocol insecurity problem for a finite number of sessions (fixed number of interleaved runs). We show that this problem is NP-complete in a Dolev-Yao model of intruders. The result does not assume a limit on the size of messages and supports non-atomic symmetric encryption keys. We also prove that in order to build an attack with a fixed number of sessions...
متن کاملPoint Set Isolation Using Unit Disks is NP-complete
We consider the situation where one is given a set S of points in the plane and a collection D of unit disks embedded in the plane. We show that finding a minimum cardinality subset of D such that any path between any two points in S is intersected by at least one disk is NP-complete. This settles an open problem raised in [1]. Using a similar reduction, we show that finding a minimum cardinali...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 1990
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita/1990240504591